The Direct Sum of Universal Relations
نویسنده
چکیده
The universal relation is the communication problem in which Alice and Bob get as inputs two distinct strings, and they are required to find a coordinate on which the strings differ. The study of this problem is motivated by its connection to Karchmer-Wigderson relations [KW90], which are communication problems that are tightly related to circuit-depth lower bounds. In this paper, we prove a direct sum theorem for the universal relation, namely, we prove that solving m independent instances of the universal relation is m times harder than solving a single instance. More specifically, it is known that the deterministic communication complexity of the universal relation is at least n. We prove that the deterministic communication complexity of solving m independent instances of the universal relation is at least m · (n−O(logm)).
منابع مشابه
Generalized Approximate Amenability of Direct Sum of Banach Algebras
In the present paper for two $mathfrak{A}$-module Banach algebras $A$ and $B$, we investigate relations between $varphi$-$mathfrak{A}$-module approximate amenability of $A$, $psi$-$mathfrak{A}$-module approximate amenability of $B$, and $varphioplus psi$-$mathfrak{A}$-module approximate amenability of $Aoplus B$ ($l^1$-direct sum of $A$ and $B$), where $varphiin$ Hom$_{mathfrak{A}}(A)$ and $psi...
متن کاملAn investigation on regular relations of universal hyperalgebras
In this paper, by considering the notion of $Sigma$-hyperalgebras for an arbitrary signature $Sigma$, we study the notions of regular and strongly regular relations on a $Sigma$-hyperalgebra, $mathfrak{A}$. We show that each regular relation which contains a strongly regular relation is a strongly regular relation. Then we concentrate on the connection between the fundamental relation of $mathf...
متن کاملOptimal Universal Uncertainty Relations
We study universal uncertainty relations and present a method called joint probability distribution diagram to improve the majorization bounds constructed independently in [Phys. Rev. Lett. 111, 230401 (2013)] and [J. Phys. A. 46, 272002 (2013)]. The results give rise to state independent uncertainty relations satisfied by any nonnegative Schur-concave functions. On the other hand, a remarkable...
متن کاملBEST APPROXIMATION IN QUASI TENSOR PRODUCT SPACE AND DIRECT SUM OF LATTICE NORMED SPACES
We study the theory of best approximation in tensor product and the direct sum of some lattice normed spacesX_{i}. We introduce quasi tensor product space anddiscuss about the relation between tensor product space and thisnew space which we denote it by X boxtimesY. We investigate best approximation in direct sum of lattice normed spaces by elements which are not necessarily downwardor upward a...
متن کاملAn annotation scheme for Persian based on Autonomous Phrases Theory and Universal Dependencies
A treebank is a corpus with linguistic annotations above the level of the parts of speech. During the first half of the present decade, three treebanks have been developed for Persian either originally or subsequently based on dependency grammar: Persian Treebank (PerTreeBank), Persian Syntactic Dependency Treebank, and Uppsala Persian Dependency Treebank (UPDT). The syntactic analysis of a sen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 24 شماره
صفحات -
تاریخ انتشار 2017